Termination w.r.t. Q proof of /tmp/tmpBWbCmQ/4.19.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

-(-(neg(x), neg(x)), -(neg(y), neg(y))) → -(-(x, y), -(x, y))

Q is empty.

↳ QTRS

  ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

-(-(neg(x), neg(x)), -(neg(y), neg(y))) → -(-(x, y), -(x, y))

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

-(-(neg(x), neg(x)), -(neg(y), neg(y))) → -(-(x, y), -(x, y))

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

-(-(neg(x), neg(x)), -(neg(y), neg(y))) → -(-(x, y), -(x, y))

Used ordering:
Polynomial interpretation [25]:

POL(-(x₁, x₂)) = 2·x₁ + x₂
POL(neg(x₁)) = 2 + 2·x₁

↳ QTRS

  ↳ RRRPoloQTRSProof

    ↳ QTRS

      ↳ RisEmptyProof

Q restricted rewrite system:
R is empty.
Q is empty.

The TRS R is empty. Hence, termination is trivially proven.